Additional Winning Strategies in Two-Player Games
نویسندگان
چکیده
We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.
منابع مشابه
Winning Strong Games through Fast Strategies for Weak Games
We prove that, for sufficiently large n, the first player can win the strong perfect matching and Hamilton cycle games. For both games, explicit winning strategies of the first player are given. In devising these strategies we make use of the fact that explicit fast winning strategies are known for the corresponding weak games.
متن کاملOptimizing Winning Strategies in Regular Infinite Games
We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and – for games with liveness requests as ...
متن کاملWeak Determinacy and Decidability of Reachability Games with Partial Observation
We consider two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions. We prove that in such games, either player 1 has a strategy for winning with probability 1, or player 2 has a strategy for winning with probability 1, or both players have strategies that guarantee winning with strictly positive probability (positively winn...
متن کاملGames with additional winning strategies
In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player finite games, under the reachability objective. We provide an automata-based technique that, given such a game, it a...
متن کاملA Partial-Observation Stochastic Games: How to Win when Belief Fails
In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitelymany rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the firs...
متن کامل